Classes of Polynomials Having Only One Non{cyclotomic Irreducible Factor
نویسنده
چکیده
He noted then that the conjecture is true if n = p 1 2 or if n = p where p is a prime and r a positive integer. Calculations showed the conjecture also held for n 100. Recently, in a study of more general polynomials, the rst author [2] obtained further irreducibility results for f(x); in particular, he established irreducibility in the case that n+ 1 is a squarefree number 3 and in the case that n = 2p 1 where p is prime. The third author independently observed that f (x) is Eisenstein if n = p 1 for every integer k 2 [1; n 1] and, based on some further computations, conjectured:
منابع مشابه
On the factorization of polynomials with small Euclideannorm
Throughout this paper, we refer to the non-cyclotomic part of a polynomial f(x) 2 Z[x] as f(x) with its cyclotomic factors removed. More speci cally, if g1(x); : : : ; gr(x) are non-cyclotomic irreducible polynomials in Z[x] and gr+1(x); : : : ; gs(x) are cyclotomic polynomials such that f(x) = g1(x) gr(x) gr+1(x) gs(x), then g1(x) gr(x) is the non-cyclotomic part of f(x). We refer to a polynom...
متن کاملOn explicit factors of cyclotomic polynomials over finite fields
We study the explicit factorization of 2nr-th cyclotomic polynomials over finite field Fq where q, r are odd with (r, q) = 1. We show that all irreducible factors of 2nr-th cyclotomic polynomials can be obtained easily from irreducible factors of cyclotomic polynomials of small orders. In particular, we obtain the explicit factorization of 2n5-th cyclotomic polynomials over finite fields and co...
متن کاملShort, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs
When constructing practical zero-knowledge proofs based on the hardness of the RingLWE or the Ring-SIS problems over polynomial rings Zp[X]/(X + 1), it is often necessary that the challenges come from a set C that satisfies three properties: the set should be large (around 2), the elements in it should have small norms, and all the non-zero elements in the difference set C −C should be invertib...
متن کاملSymmetry classes of polynomials associated with the dihedral group
In this paper, we obtain the dimensions of symmetry classes of polynomials associated with the irreducible characters of the dihedral group as a subgroup of the full symmetric group. Then we discuss the existence of o-basis of these classes.
متن کاملOn the Reducibility of Cyclotomic Polynomials over Finite Fields
The irreducibility of a polynomial in a prime modulus implies irreducibility over the rationals. However, the converse is certainly not true. In fact, there are some polynomials that are irreducible over the rationals yet reducible in every prime modulus. We show that the nth cyclotomic polynomial reduces modulo all primes if and only if the discriminant of the nth cyclotomic polynomial is a sq...
متن کامل